Public transport fleet scheduling for minimizing total transfer waiting time

Authors

Abstract:

Public transportation has been one of the most important research fields in the two last decades. The purpose of this paper is to create a schedule for public transport fleets such as buses and metro trains with the goal of minimizing the total transfer waiting time. We extend previous research works in the field of transit schedule with considering headways of each route as decision variables. In this paper, we formulate the problem as a mixed integer linear programming model and solve it using ILOG CPLEX solver. For large-scale test instances, we develop a metaheuristic based on the scatter search algorithm to obtain good solutions in a reasonable CPU run times. Finally, in the computational section, the efficiency of the proposed model and developed algorithm are compared with the existing results in the literature on a real railway network.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A Mathematical Model for Scheduling Elective Surgeries for Minimizing the Waiting Times in Emergency Surgeries

The ever-increasing demands for surgeries and the limited resources force hospitals to have efficient management of resources, especially the expensive ones like operating rooms (ORs). Scheduling surgeries including sequencing them, assigning resources to them and determining their start times is a complicated task for hospital managers. Surgery referrals usually include elective surgeries that...

full text

Minimizing the Waiting Time for Emergency Surgery

Hospitals aim to deliver the highest quality of care. One key priority is to schedule emergency surgeries as quickly as possible, because postponing them generally increases a patient’s risk of complications and even death. In this paper, we consider the case that emergency surgeries are scheduled in one of the elective Operating Rooms (ORs). In this situation, emergency patients are operated o...

full text

Finding the nearest facility for travel and waiting time in a transport network

One of user's queries from navigation service is to find the nearest facility in terms of time. The facility that is being questioned by the user as a destination may have a queuing service system (e.g. bank), which means that the cost function of the shortest path includes the waiting time at the destination as well as the travel time. This research conducts in the zone 1 of Mashhad with Bank ...

full text

Fuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...

full text

Minimizing waiting time in last mile delivery for smart city

Customers consider a reliable and on-time last mile delivery in Omni-channel business as important as price and good’s quality. We focus on minimizing the waiting time for customers and carriers in last mile delivery. We model the problem as an optimization problem and develop Genetic Algorithm to solve it.

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 28  issue 2

pages  113- 128

publication date 2017-06

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023